#include<iostream>

using namespace std;

const int N =1e5+10;

int a[N],tmp[N];


void gbsort(int q[],int l,int r)
{
    if(l>=r) return;

    int mid=l+r>>1;

    gbsort(q,l,mid),gbsort(q,mid+1,r);

    int k=0,i=l,j=mid+1;
    while(i<=mid&&j<=r){
    	if(q[i]<=q[j]) tmp[k++]=q[i++];
        else tmp[k++]=q[j++];
	}
        
    while(i<=mid) tmp[k++]=q[i++];
    while(j<=r) tmp[k++]=q[j++];

    for (i=l,j=0;i<=r;i++,j++) q[i]=tmp[j];
}


int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++ ) scanf("%d",&a[i]);

    gbsort(a,0,n-1);

    for (int i=0;i<n;i++) printf("%d ",a[i]);

    return 0;
}

